Geometric tree graphs of points in the plane
نویسندگان
چکیده
M. C. Hernando1, F. Hurtado1, A. M arquez2, M. Mora1, M. Noy1
منابع مشابه
The second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملCompatible Trees ∗
Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...
متن کاملMaximum Plane Trees in Multipartite Geometric Graphs
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...
متن کاملEncompassing colored crossing-free geometric graphs
Given n red and n blue points in the plane and a planar straight line matching between the red and the blue points, the matching can be extended into a bipartite planar straight line spanning tree. That is, any red-blue planar matching can be completed into a crossing-free red-blue spanning tree. Such a tree can be constructed in O(n log n) time. keywords: geometric graph, spanning tree, color
متن کاملA sufficient condition for the existence of plane spanning trees on geometric graphs
Let P be a set of n ≥ 3 points in general position in the plane and let G be a geometric graph with vertex set P . If the number of empty triangles 4uvw in P for which the subgraph of G induced by {u, v, w} is not connected is at most n− 3, then G contains a non-self intersecting spanning tree.
متن کامل